Secure Broadcasting With Side-Information

نویسندگان

  • Kyatsandra G. Nagananda
  • Chandra R. Murthy
  • Shalinee Kishore
چکیده

In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to broadcast two independent messages to two receivers, under the constraint that each message should be kept confidential from the unintended receiver. Furthermore, the encoder has side-information for example, fading in the wireless medium, interference caused by neighboring nodes in the network, etc. provided to it in a noncausal manner, i.e., before the process of transmission. We derive an inner bound on the capacity region of this channel, by employing an extension of Marton’s coding technique used for the classical two-user broadcast channel, in conjunction with a stochastic encoder to satisfy confidentiality constraints. Based on previously known results, we discuss a procedure to present a schematic of the achievable rate region. The rate-penalties for dealing with side-information and confidentiality constraints make the achievable region for this channel strictly smaller than the rate regions of those channels where one or both of these constraints are relaxed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Channel Estimation for DVB-T2 Systems by Utilizing Side Information on OFDM Sparse Channel Estimation

The second generation of digital video broadcasting (DVB-T2) standard utilizes orthogonal frequency division multiplexing (OFDM) system to reduce and to compensate the channel effects by utilizing its estimation. Since wireless channels are inherently sparse, it is possible to utilize sparse representation (SR) methods to estimate the channel. In addition to sparsity feature of the channel, the...

متن کامل

Cryptanalysis of Improved Liaw's Broadcasting Cryptosystem

A secure broadcasting cryptosystem must provide a secure communication channel from a sender to a group of legal or authorized receivers. Many of the proposed systems [3-5] require a large number of broadcast messages and present a number of problems. Moreover, Liaw [2] proposed a secure broadcasting scheme with fewer broadcasting messages, which allows easy insertion of new users into the acti...

متن کامل

Broadcasting Session Keys

This paper considers true broadcast systems for the secure communication of session keys. These are schemes that provide for parallel rather than serial construction of broadcast messages, while avoiding selective broadcasting. We improve upon a model implemented with Shamir's threshold scheme, and use information theoretic techniques to show that this enhancement is optimal. We then present a ...

متن کامل

Secure broadcasting in large networks

It is common that users or hosts in a large network are partitioned and organized as a hierarchical tree where children of the same parent form a group. Secure broadcasting intends to provide a secure communication channel from a sending principal to a group of legal receiving principals. Only legal receiving principals can decrypt the message, and illegal receiving principals cannot acquire an...

متن کامل

Capacity Bounds for State-Dependent Broadcast Channels

In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a sender broadcasting two independent messages to two non-cooperating receivers; for channels of the second class, each receiver is given the message it need n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1109.2766  شماره 

صفحات  -

تاریخ انتشار 2011